Voronoi Diagram for services neighboring a highway
نویسندگان
چکیده
We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less than or equal time to any other. We consider the time to follow a shortest time path to be the time distance between the two points. In this paper, we give a simple algorithm for computing the Time Voronoi Diagram, that is, the Voronoi Diagram of a set of points using the time distance. 2003 Elsevier Science B.V. All rights reserved.
منابع مشابه
Time - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملVoronoi-Neighboring Regions Tree for Efficient Processing of Location Dependent Queries
As a data management technique, indexing aims to judicious organization of data allowing efficient query processing. In the context of location based services (LBSs), indexing techniques are, substantially, affected by location dependency and modes of data access. This paper focuses on the processing of location dependent queries (nearest neighbors and range queries) based on indexing structure...
متن کاملConstructing Area Voronoi Diagram Based on Direct Calculation of the Freeman Code of Expanded Contours
A Voronoi diagram of image elements provides an intuitive and appealing definition of proximity, which has been suggested as an effective tool for the description of relations among the neighboring objects in a digital image. In this paper, an implementation algorithm based on direct calculation of the Freeman code of expanded contours is proposed for generating area Voronoi diagram of connecte...
متن کاملApproximate Voronoi Cell Computation on Geometric Data Streams
Several studies have exploited the properties of Voronoi diagrams to improve variations of the nearest neighbor search on stored datasets. However, the significance of Voronoi diagrams and their basic building blocks, Voronoi cells, has been neglected when the geometry data is incrementally becoming available as a data stream. In this paper, we study the problem of Voronoi cell computation for ...
متن کاملSupport-Free Hollowing for 3D Printing via Voronoi Diagram of Ellipses
Recent work has demonstrated that the interior material layout of a 3D model can be designed to make a fabricated replica satisfy application-specific demands on its physical properties such as resistance to external loads. A widely used practice to fabricate such models is by layer-based additive manufacturing (AM) or 3D printing, which however suffers from the problem of adding and removing i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 86 شماره
صفحات -
تاریخ انتشار 2003